Edge Number of 3-Connected Diameter 3 GraphsTSAI, Mine-Chun; FU, Hung-Lin.International Symposium on Parallel Architectures, Algorithms, and Networks. 2004, pp 364-367, isbn 0-7695-2135-5, 1Vol, 4 p.Conference Paper

The average connectivity of a graphBEINEKE, Lowell W; OELLERMANN, Ortrud R; PIPPERT, Raymond E et al.Discrete mathematics. 2002, Vol 252, Num 1-3, pp 31-45, issn 0012-365XArticle

A note on counting connected graph covering projectionsHOFMEISTER, M.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 2, pp 286-292, issn 0895-4801Article

Some notes on domination edge critical graphsNADER JAFARI RAD; SAYYED HEIDAR JAFARI.Comptes rendus. Mathématique. 2011, Vol 349, Num 9-10, pp 485-488, issn 1631-073X, 4 p.Article

On the spectral Ádám property for circulant graphsMANS, Bernard; PAPPALARDI, Francesco; SHPARLINSKI, Igor et al.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 309-329, issn 0012-365XArticle

Linear algorithm for 3-coloring of locally connected graphsKOCHOL, Martin.Lecture notes in computer science. 2003, pp 191-194, issn 0302-9743, isbn 3-540-40205-5, 4 p.Conference Paper

Forbidden subgraphs and the existence of paths and cycles passing through specified verticesFUJISAWA, Jun; OTA, Katsuhiro; SUGIYAMA, Takeshi et al.Discrete mathematics. 2008, Vol 308, Num 24, pp 6111-6114, issn 0012-365X, 4 p.Article

Periodic graphs and connectivity of the rational digital hyperplanesGERARD, Yan.Theoretical computer science. 2002, Vol 283, Num 1, pp 171-182, issn 0304-3975Conference Paper

Cycles in the cube-connected cycles graphGERMA, A; HEYDEMANN, M.-C; SOTTEAU, D et al.Discrete applied mathematics. 1998, Vol 83, Num 1-3, pp 135-155, issn 0166-218XArticle

A construction of 3-connected graphsBARNETTE, D. W.Israel Journal of Mathematics. 1994, Vol 86, Num 1-3, pp 397-407, issn 0021-2172Article

Computational FolkloristicsABELLO, James; BROADWELL, Peter; TANGHERLINI, Timothy R et al.Communications of the ACM. 2012, Vol 55, Num 7, pp 60-70, issn 0001-0782, 11 p.Article

On the minimum real roots of the adjoint polynomial of a graphHAIXING ZHAO; RUYING LIU.Discrete mathematics. 2009, Vol 309, Num 13, pp 4635-4641, issn 0012-365X, 7 p.Article

On the number of edges in graphs with a given weakly connected domination numberSANCHIS, Laura A.Discrete mathematics. 2002, Vol 257, Num 1, pp 111-124, issn 0012-365X, 14 p.Article

Disconnected graph layout and the polyomino packing approachFREIVALDS, Karlis; DOGRUSOZ, Ugur; KIKUSTS, Paulis et al.Lecture notes in computer science. 2002, pp 378-391, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Calculating a relational program for transitive reductions of strongly connected graphsBERGHAMMER, Rudolf; HOFFMANN, Thorsten.Lecture notes in computer science. 2002, pp 258-275, issn 0302-9743, isbn 3-540-00315-0, 18 p.Conference Paper

A note on self-stabilizing articulation point detectionCHAUDHURI, P.Journal of systems architecture. 1999, Vol 45, Num 14, pp 1249-1252, issn 1383-7621Article

Degree-constrained network spanners with nonconstant delayLIESTMAN, A. L; SHERMER, T. C.SIAM journal on discrete mathematics (Print). 1995, Vol 8, Num 2, pp 291-321, issn 0895-4801Article

The exists no distance-regular graph with intersection array (5,4,3; 1,1,2)FON-DER-FLAASS, D. G.European journal of combinatorics. 1993, Vol 14, Num 5, pp 409-412, issn 0195-6698Article

Enumerating spanning and connected subsets in graphs and matroidsKHACHIYAN, L; BOROS, E; BORYS, K et al.Lecture notes in computer science. 2006, pp 444-455, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

An optimal distributed algorithm for computing bridge-connected componentsCHAUDHURI, P.Computer journal (Print). 1997, Vol 40, Num 4, pp 200-207, issn 0010-4620Article

On computing all maximal cliques distributedlyPROTTI, F; FRANCA, F. M. G; SZWARCFITER, J. L et al.Lecture notes in computer science. 1997, pp 37-48, issn 0302-9743, isbn 3-540-63138-0Conference Paper

On the anti-Kekulé number of leapfrog fullerenesKUTNAR, Klavdija; SEDLAR, Jelena; VUKICEVIC, Damir et al.Journal of mathematical chemistry. 2009, Vol 45, Num 2, pp 431-441, issn 0259-9791, 11 p.Conference Paper

Pairs of largest circuits in 3-connected matroidsLEMOS, Manoel; REID, Talmage James; WILLIAMS, Bryan et al.Linear algebra and its applications. 2007, Vol 427, Num 2-3, pp 313-316, issn 0024-3795, 4 p.Article

Planarity testing of graphs on base of a spring modelHOTZ, Günter; LOHSE, Steffen.Lecture notes in computer science. 2002, pp 471-472, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Engineering diffusive load balancing algorithms using experimentsDIEKMANN, R; MUTHUKRISHNAN, S; NAYAKKANKUPPAM, M. V et al.Lecture notes in computer science. 1997, pp 111-122, issn 0302-9743, isbn 3-540-63138-0Conference Paper